Learning Parameterized ODEs From Data

نویسندگان

چکیده

In contemporary research, neural networks are being used to derive Ordinary Differential Equations (ODEs) from observations. However, parameterized ODEs pose a more significant challenge than non-parameterized since the required understand roles of parameters, i.e., structure equations. This paper proposes novel approach by combining Symbolic Neural Network (S-Net) with ODE Solver solve this issue. First, S-Net learns and then predicts dynamics based on new parameters initial states. To assess its performance, we compare our widely (O-Net) that directly ODEs. Our numerical experiments demonstrate outperforms O-Net when applied Lotka-Volterra Lorenz

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enhancing Learning from Imbalanced Classes via Data Preprocessing: A Data-Driven Application in Metabolomics Data Mining

This paper presents a data mining application in metabolomics. It aims at building an enhanced machine learning classifier that can be used for diagnosing cachexia syndrome and identifying its involved biomarkers. To achieve this goal, a data-driven analysis is carried out using a public dataset consisting of 1H-NMR metabolite profile. This dataset suffers from the problem of imbalanced classes...

متن کامل

Learning About ODEs Using Interactive Online Modules

This paper discusses the development and implementation of a set of online teaching and learning modules for the modeling and solution of simple linear Ordinary Differential Equations (ODEs). The paper describes how constructivist principles are used in the development of these modules and how in-built assessment has been used to enhance student learning. A discussion of the module structure is...

متن کامل

Reinforcement Learning in Parameterized Models Reinforcement Learning with Polynomial Learning Rate in Parameterized Models

We consider reinforcement learning in a parameterized setup, where the model is known to belong to a finite set of Markov Decision Processes (MDPs) under the discounted return criterion. We propose an on-line algorithm for learning in such parameterized models, the Parameter Elimination (PEL) algorithm, and analyze its performance in terms of the total mistakes. The algorithm relies on Wald’s s...

متن کامل

Generalized Task-Parameterized Skill Learning

Programming by demonstration has recently gained much attention due to its user-friendly and natural way to transfer human skills to robots. In order to facilitate the learning of multiple demonstrations and meanwhile generalize to new situations, a task-parameterized Gaussian mixture model (TP-GMM) has been recently developed. This model has achieved reliable performance in areas such as human...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3282435